Nibbling Java Byte Code for Resource-Critical Devices

نویسندگان

  • Vishnu Kotrajaras
  • Prabhas Chongstitvatana
چکیده

This work describes a method that makes the Java instruction as small as possible. The proposed method, called "nibble coding", compresses two instructions into one byte. The experiment is carried out to compare Java byte code instruction and a modified code with the nibble coding. The result shows the proposed scheme achieves a much smaller instruction bandwidth than the ordinary byte-code counterpart. Key-Words: code compression, instruction bandwidth, Java byte code

برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

ثبت نام

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

منابع مشابه

Byte Code Verification for Java Smart Card Based on Model Checking

The paper presents a novel approach to Java byte code veri cation: The veri cation process is performed \o ine" on a network server, instead of incorporating it in the client. Furthermore, the most critical part of the veri cation process is based upon a formal model and uses a model checker for checking the veri cation conditions. The result of the veri cation process can be securely communica...

متن کامل

Extending Camelot with Mutable State and Concurrency

Camelot is a resource-bounded functional programming language which compiles to Java byte code to run on the Java Virtual Machine. We extend Camelot to include language support for Camelot-level threads which are compiled to native Java threads. We extend the existing Camelot resource-bounded type system to provide safety guarantees about the heap usage of Camelot threads.

متن کامل

Certified Memory Usage Analysis

We present a certified algorithm for resource usage analysis, applicable to languages in the style of Java byte code. The algorithm verifies that a program executes in bounded memory. The algorithm is destined to be used in the development process of applets and for enhanced byte code verification on embedded devices. We have therefore aimed at a low-complexity algorithm derived from a loop det...

متن کامل

Generating Eecient Stack Code for Java

Optimizing Java byte code is complicated by the fact that it uses a stack-based execution model. Changing the intermediate representation from the stack-based to the register-based one brings the problem of Java byte code optimizations into well-studied domain of compiler optimizations for register-based codes. In this paper we describe the technique to convert a register-based code into the Ja...

متن کامل

Byte Code Engineering

The term “Java” is used to denote two different concepts: the language itself and the related execution environment, the Java Virtual Machine (JVM), which executes byte code instructions. Several research projects deal with byte code-generating compilers or the implementation of new features via byte code transformations. Examples are code optimization, the implementation of parameterized types...

متن کامل

ذخیره در منابع من


  با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید

برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

ثبت نام

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

عنوان ژورنال:

دوره   شماره 

صفحات  -

تاریخ انتشار 2003